#include "tree.h"

int main()
{
    char a[] = {'a', 'b', 'c', ' ', ' ', 'd', 'e', ' ', 'g', ' ', ' ', 'f', ' ', ' ', ' '};
    int pi = 0;
    BTNode *root = BinaryTreeCreate(a, sizeof(a) / sizeof(a[0]), &pi);
    BinaryTreePrevOrder(root);
    printf("\n");

    BinaryTreeInOrder(root);
    printf("\n");

    BinaryTreePostOrder(root);
    printf("\n");

    printf("TreeSize : %d\n", BinaryTreeSize(root));
    printf("TreeKLevel : %d\n", BinaryTreeLevelKSize(root, 3));

    BTNode *ret = BinaryTreeFind(root, 3);
    printf("TreeFind : %p\n", ret);

    // BinaryTreeLevelOrder(root);
    printf("\n");
    printf("BinaryTreeComplete %d\n ", BinaryTreeComplete(root));
    BinaryTreeDestroy(&root);
    root = NULL;

    return 0;
}